On fuzzy multiset regular grammars
نویسندگان
چکیده
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy multiset right linear grammars, fuzzy multiset grammars in normal form. 2010 AMS Classification: 68Q45, 03D05
منابع مشابه
On fuzzy multiset regular languages
The purpose of present work is to study some algebraic aspect of fuzzy multiset regular languages. In between, we show the equivalence of multiset regular language and fuzzy multiset regular language. Finally, we introduce the concept of pumping lemma for fuzzy multiset regular languages, which we use to establish a necessary and sufficient condition for a fuzzy multiset language to be non-cons...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملConstraint Relation Multiset Grammars for Visual Languages
This paper proposes grammars for visual languages. The proposed grammars introduce relations into the constraint multiset grammars[4J. Relations are the constraints on the relationships among symbols in visual languages. The proposed grammars. which are called constraint relation multiset grammars. have the relations as the first class citizens of the grammars because the relationships among sy...
متن کاملREDUNDANCY OF MULTISET TOPOLOGICAL SPACES
In this paper, we show the redundancies of multiset topological spaces. It is proved that $(P^star(U),sqsubseteq)$ and $(Ds(varphi(U)),subseteq)$ are isomorphic. It follows that multiset topological spaces are superfluous and unnecessary in the theoretical view point.
متن کاملFuzzy automaton induction using neural network
It has been shown that neural networks are able to infer regular crisp grammars from positive and negative examples. The fuzzy grammatical inference (FGI) problem however has received considerably less attention. In this paper we show that a suitable two-layer neural network model is able to infer fuzzy regular grammars from a set of fuzzy examples belonging to a fuzzy language. Once the networ...
متن کامل